Convex Grid Drawings of 3-Connected Planar Graphs
نویسندگان
چکیده
We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, non-intersecting line segments and faces are convex polygons. We present a linear-time algorithm which, given an n-vertex 3connected plane graph G (with n 3), nds such a straight-line convex embedding of G into a (n 2) (n 2) grid.
منابع مشابه
Monotone Grid Drawings of Planar Graphs
Amonotone drawing of a planar graph G is a planar straightline drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this pap...
متن کاملStrongly Monotone Drawings of Planar Graphs
A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the direction of the line segment connecting the two vertices. We present algorithms to compute crossing-free strongly monotone drawings for some classe...
متن کاملMinimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
A convex drawing of a plane graph G is a plane drawing of G, where each vertex is drawn as a point, each edge is drawn as a straight line segment and each face is drawn as a convex polygon. A maximal segment is a drawing of a maximal set of edges that form a straight line segment. A minimum-segment convex drawing of G is a convex drawing of G where the number of maximal segments is the minimum ...
متن کاملConvex Grid Drwaings of Four-Connected Plane Graphs
A convex grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on grid points, all edges are drawn as straight-line segments between their endpoints without any edge-intersection, and every face boundary is a convex polygon. In this paper we give a linear-time algorithm for finding a convex grid drawing of any 4-connected plane graph G with four or mor...
متن کاملCanonical Ordering for Graphs on the Cylinder, with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus
We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) 3connected maps. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack (in the triangulated case) and of Kant (in the 3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997